Tight lower bound instances for k-means++ in two dimensions
نویسندگان
چکیده
منابع مشابه
A Tight Lower Bound Instance for k-means++ in Constant Dimension
The k-means++ seeding algorithm is one of the most popular algorithms that is used for finding the initial k centers when using the k-means heuristic. The algorithm is a simple sampling procedure and can be described as follows: Pick the first center randomly from the given points. For i > 1, pick a point to be the i center with probability proportional to the square of the Euclidean distance o...
متن کاملA Tight Lower Bound for k-Set Agreement
We prove tight bounds on the time needed to solve k-set agreement, a natural generalization of consensus. We analyze this problem in a synchronous, message-passing model where processors fail by crashing. We prove a lower bound of [f/k] + 1 rounds of communication for solutions to k-set agreement that tolerate f failures. This bound is tight, and shows that there is an inherent tradeoff between...
متن کاملA Tight Lower Bound for Processor Coordination
We prove a tight lower bound on the running time of oblivious solutions to k set agreement In k set agreement processors start with input values from a given set and choose output values from the same set In every execution the set of output values must be contained in the set of input values and the set of output values must have size at most k A solution is oblivious if it does not make use o...
متن کاملA Tight Lower Bound for Streett Complementation
Finite automata on infinite words (ω-automata) proved to be a powerful weapon for mod-eling and reasoning infinite behaviors of reactive systems. Complementation of ω-automata iscrucial in many of these applications. But the problem is non-trivial; even after extensive studyduring the past two decades, we still have an important type of ω-automata, namely Streettautomata, for wh...
متن کاملClustering Stable Instances of Euclidean k-means
The Euclidean k-means problem is arguably the most widely-studied clustering problem in machine learning. While the k-means objective is NP-hard in the worst-case, practitioners have enjoyed remarkable success in applying heuristics like Lloyd’s algorithm for this problem. To address this disconnect, we study the following question: what properties of real-world instances will enable us to desi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2016
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2016.04.012